Diagonal tree codes

Diagonal algebraic space-time block codes

We construct a new family of linear space-time block codes by the combination of rotated constellations and the Hadamard transform, and we prove them to achieve the full transmit diversity over a quasi-static or fast fading channels. The proposed codes transmit at a normalized rate of 1 symbol/sec. When the number of transmit antennae n = 1, 2 or n is a multiple of 4 we spread a rotated version...

On diagonal algebraic space-time block codes

Theoretical and practical aspects of diagonal algebraic space-time block codes over n transmit andm receive antennae are examined. These codes are obtained by sending a rotated version of the information symbols over the principal diagonal of the n × n space-time matrix over n transmit antennae and n symbol periods. The output signal-to-noise ratios of two pre-decoding filters and two decoding ...

Cascaded Tree Codes

On Diagonal Space-Time Codes Using Algebraic Rotations

Theoretical and practical aspects of diagonal algebraic space-time block codes over n transmit and m receive antennae are examined. The output signal-to-noise ratios of two pre-decoding filters and two decoding algorithms are derived. Analysis of the information loss incurred by using the codes considered is used to clarify their structures, and the expected performances. Different algebraic re...

Performance Bounds on Product Codes with Hyper-Diagonal Parity